On Generalizing Rough Set Theory

نویسنده

  • Yiyu Yao
چکیده

This paper summarizes various formulations of the standard rough set theory. It demonstrates how those formulations can be adopted to develop different generalized rough set theories. The relationships between rough set theory and other theories are discussed. 1 Formulations of Standard Rough Sets The theory of rough sets can be developed in at least two different manners, the constructive and algebraic methods [16–20, 25, 29]. The constructive methods define rough set approximation operators using equivalence relations or their induced partitions and subsystems; the algebraic methods treat approximation operators as abstract operators. 1.1 Constructive methods Suppose U is a finite and nonempty set called the universe. Let E ⊆ U × U be an equivalence relation on U . The pair apr = (U,E) is called an approximation space [6, 7]. A few definitions of rough set approximations can be given based on different representations of an equivalence relation. An equivalence relation E can be conveniently represented by a mapping from U to 2 , where 2 is the power set of U . More specifically, the mapping [·]E is given by: [x]E = {y ∈ U | xEy}. (1) The subset [x]E is the equivalence class containing x. The family of all equivalence classes is commonly known as the quotient set and is denoted by U/E = {[x]E | x ∈ U}. It defines a partition of the universe, namely, a family of pairwise disjoint subsets whose union is the universe. A new family of subsets, denoted by σ(U/E), can be obtained from U/E by adding the empty set ∅ and making it closed under set union, which is a subsystem of 2 . In fact, it is an σ-algebra of subsets of U and a sub-Boolean algebra of the Boolean algebra (2 , ,∩,∪). Furthermore, σ(U/E) defines uniquely a topological space (U, σ(U/E)), in which σ(U/E) is the family of all open and closed sets [6]. Under the equivalence relation, we only have a coarsened view of the universe. Each equivalence class is considered as a whole granule instead of many individuals [21]. They are considered as the basic or elementary definable, observable, or measurable subsets of the universe [7, 20]. By the construction of Yao, Y.Y., On generalizing rough set theory, Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, Proceedings of the 9th International Conference (RSFDGrC 2003), LNAI 2639, pp. 44-51, 2003.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological structure on generalized approximation space related to n-arry relation

Classical structure of rough set theory was first formulated by Z. Pawlak in [6]. The foundation of its object classification is an equivalence binary relation and equivalence classes. The upper and lower approximation operations are two core notions in rough set theory. They can also be seenas a closure operator and an interior operator of the topology induced by an equivalence relation on a u...

متن کامل

T-Rough Sets Based on the Lattices

The aim of this paper is to introduce and study set- valued homomorphism on lattices and T-rough lattice with respect to a sublattice. This paper deals with T-rough set approach on the lattice theory. The result of this study contributes to, T-rough fuzzy set and approximation theory and proved in several papers. Keywords: approximation space; lattice; prime ideal; rough ideal; T-rough set; set...

متن کامل

Rough ideals based on ideal determined varieties

The paper is devoted to concern a relationship between rough set theory and universal algebra. Notions of lower and upper rough approximations on an algebraic structure induced by an ideal are introduced and some of their properties are studied. Also, notions of rough subalgebras and rough ideals with respect to an ideal of an algebraic structure, which is an extended notion of subalgebras and ...

متن کامل

Application of Rough Set Theory in Data Mining for Decision Support Systems (DSSs)

Decision support systems (DSSs) are prevalent information systems for decision making in many competitive business environments. In a DSS, decision making process is intimately related to some factors which determine the quality of information systems and their related products. Traditional approaches to data analysis usually cannot be implemented in sophisticated Companies, where managers ne...

متن کامل

ارائه روشی ترکیبی برای افزایش دقت پیش‌بینی در کاهش داده با استفاده از مدل مجموعه راف و هوش تجمعی

Designing a system with an emphasis on minimal human intervention helps users to explore information quickly. Adverting to methods of analyzing large data is compulsory as well. Hence, utilizing power of the data mining process to identify patterns and models become more essential from aspect of relationship between the various elements in the database and discover hidden knowledge. Therefore, ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003